منابع مشابه
Confluence Theory for Graphs
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg’s spiders) in an arbitrary surface. As a further conse...
متن کاملDetection Theory for Graphs
For many Lincoln Laboratory mission areas, relationships between entities of interest are important. Over the years, much work has gone into the detection of entities, such as radio emissions, vehicles in images, or people named in documents. The examination of relationships between entities (Which emitters are co-located? Which vehicles stopped at the same place? What people are mentioned in t...
متن کاملDiagram Techniques for Confluence
We develop diagram techniques for proving confluence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, widely scattered throughout the literature, can be understood. These results include Newman's lemma, Lemma 3.1 of Winkler and Buchberger, the Hindley Rosen lemma, the Request lemmas of Staples, the Strong Confluen...
متن کاملExtremal Ramsey theory for graphs
If G and H are graphs, define the Ramsey number to be the least number p such that if the lines of the complete graph Kp are colored red and blue (say),either the red subgraph contains a copy of G or the blue subgraph contains H. Also set r(G) = r(G,G) ; these are called the diagonal Ramsey numbers. These definitions are taken from Chvátal and Harary [1J ; other terminology will follow Harary [...
متن کاملA Homotopy Theory for Graphs
In the recent article [3] a new homotopy theory for graphs and simplicial complexes was defined. The motivation for the definition came initially from a desire to find invariants for dynamic processes that could be encoded via (combinatorial) simplicial complexes. The invariants should be topological in nature, but should at the same time be sensitive to the combinatorics encoded in the complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic & Geometric Topology
سال: 2007
ISSN: 1472-2739,1472-2747
DOI: 10.2140/agt.2007.7.439